Lower bound for the capacitated multicommodity flow problem
ثبت نشده
چکیده
منابع مشابه
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
This paper addresses the multicommodity capacitated fixed-charge network design problem with nonbifurcated flows and hop constraints. We present and compare mathematical programming formulations for this problem and we study different relaxations: linear programming relaxations, Lagrangean relaxations and partial relaxations of the integrality constraints. In particular, for the hop-indexed for...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملNode-Capacitated Ring Routing
We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA capacity scaling heuristic for the multicommodity capacitated network design problem
In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generat...
متن کامل